Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listFeb 11, 2026 21:59olliecrowolliecrowScore: 6,133Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 11, 2026 21:595,65876,568,24844,960,0001,998,0002,285,568
2Feb 11, 2026 21:595,68179,711,05846,148,0001,003,0002,400,256
3Feb 11, 2026 21:595,87572,151,84243,784,0004,975,0002,453,504
4Feb 11, 2026 21:596,13375,280,48746,910,0003,992,0002,314,240
5Feb 11, 2026 21:596,13481,330,83046,923,0003,993,0002,383,872
6Feb 11, 2026 21:596,16080,859,58847,116,0004,009,0002,498,560