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 listApr 26, 2026 14:57wnwnScore: 3,609Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 14:573,39647,891,33527,184,0001,006,0002,490,368
2Apr 26, 2026 14:573,42939,993,82027,450,0001,016,0002,486,272
3Apr 26, 2026 14:573,43944,485,29727,530,0001,019,0002,469,888
4Apr 26, 2026 14:573,44041,688,59727,535,0001,019,0002,486,272
5Apr 26, 2026 14:573,60950,392,66827,962,0001,997,0002,490,368
6Apr 26, 2026 14:573,61747,884,52128,024,0002,001,0002,490,368
7Apr 26, 2026 14:573,61750,882,76827,117,0002,905,0002,486,272
8Apr 26, 2026 14:573,79552,073,95730,485,0001,016,0002,314,240
9Apr 26, 2026 14:574,19553,862,92232,889,0001,934,0002,318,336