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 15, 2026 06:24tqbfjotld-0tqbfjotld-0Score: 61,176Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 15, 2026 06:2461,167530,323,127505,686,0001,998,0002,285,568
2Mar 15, 2026 06:2461,176530,044,621505,762,0001,999,0002,277,376
3Mar 15, 2026 06:2461,195531,789,788505,917,0001,999,0002,285,568