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 13, 2026 14:39Dominique GarmierDominique GarmierScore: 13,752Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 13, 2026 14:3913,470137,371,385109,801,0001,996,0002,408,448
2Mar 13, 2026 14:3913,611139,545,081110,969,0001,999,0002,289,664
3Mar 13, 2026 14:3913,733143,763,212111,989,0001,999,0002,289,664
4Mar 13, 2026 14:3913,751142,049,158111,131,0003,003,0002,289,664
5Mar 13, 2026 14:3913,752142,054,554111,140,0003,003,0002,404,352
6Mar 13, 2026 14:3913,771144,357,881111,293,0003,007,0002,334,720
7Mar 13, 2026 14:3913,790140,003,250112,453,0002,008,0002,289,664
8Mar 13, 2026 14:3913,800141,536,791111,523,0003,014,0002,289,664
9Mar 13, 2026 14:3913,923145,625,813114,561,0001,004,0002,289,664