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 18, 2026 12:13shartgepettoshartgepettoScore: 6,128Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 18, 2026 12:136,07774,881,03047,417,0003,026,0002,420,736
2Mar 18, 2026 12:136,09481,287,33347,547,0003,034,0002,469,888
3Mar 18, 2026 12:136,09878,606,93148,588,0002,024,0002,375,680
4Mar 18, 2026 12:136,12279,359,23347,821,0002,988,0002,400,256
5Mar 18, 2026 12:136,12877,112,31946,874,0003,989,0002,383,872
6Mar 18, 2026 12:136,14970,680,55748,034,0003,002,0002,469,888
7Mar 18, 2026 12:136,14971,337,32448,038,0003,002,0002,408,448
8Mar 18, 2026 12:136,16473,690,16949,157,0002,006,0002,375,680
9Mar 18, 2026 12:136,26475,410,70348,994,0002,999,0002,338,816