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 listJun 1, 2026 21:01Maya RebholzMaya RebholzScore: 5,259Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 1, 2026 21:015,04651,091,29336,785,0005,099,0002,117,632
2Jun 1, 2026 21:015,06951,687,60736,782,0005,295,0002,113,536
3Jun 1, 2026 21:015,09151,402,31737,041,0005,215,0002,113,536
4Jun 1, 2026 21:015,10951,891,36437,041,0005,368,0002,117,632
5Jun 1, 2026 21:015,25953,341,52038,139,0005,511,0002,117,632
6Jun 1, 2026 21:015,29653,599,04138,347,0005,616,0002,117,632
7Jun 1, 2026 21:015,39954,005,05239,502,0005,311,0002,113,536
8Jun 1, 2026 21:015,42954,317,99539,778,0005,286,0002,117,632
9Jun 1, 2026 21:015,53655,426,73740,443,0005,508,0002,113,536