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 18:18olliecrowolliecrowScore: 6,287Success
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 18:185,89076,512,74445,893,0002,993,0002,285,568
2Feb 11, 2026 18:185,89980,606,45144,963,0003,996,0002,445,312
3Feb 11, 2026 18:185,93672,846,04047,258,0002,010,0002,351,104
4Feb 11, 2026 18:186,28782,095,41250,176,0002,007,0002,367,488
5Feb 11, 2026 18:186,31178,592,30851,377,0001,007,0002,392,064
6Feb 11, 2026 18:186,37578,214,10246,926,0005,990,0002,371,584