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 listMar 16, 2026 12:04Eric CeglieEric CeglieScore: 9,089Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 16, 2026 10:209,024101,285,09572,902,0001,997,0002,310,144
2Mar 16, 2026 10:209,042101,367,25471,044,0004,002,0002,322,432
3Mar 16, 2026 12:049,04995,420,89773,104,0002,002,0002,265,088
4Mar 16, 2026 12:049,08997,059,36872,420,0003,017,0002,420,736
5Mar 16, 2026 10:209,096101,504,00772,480,0003,020,0002,322,432
6Mar 16, 2026 12:049,097104,142,12373,496,0002,013,0002,322,432