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 02:44tqbfjotld-0tqbfjotld-0Score: 58,629Success
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 02:4458,343507,866,881483,246,0001,000,0002,285,568
2Mar 15, 2026 02:4458,567510,293,627484,104,0002,000,0002,285,568
3Mar 15, 2026 02:4458,570518,196,205484,135,0002,000,0002,392,064
4Mar 15, 2026 02:4458,629513,813,314484,620,0001,998,0002,269,184
5Mar 15, 2026 02:4458,629513,439,240486,621,00002,265,088
6Mar 15, 2026 02:4458,653512,697,329484,821,0001,999,0002,285,568
7Mar 15, 2026 02:4458,667509,163,378485,934,000999,0002,269,184
8Mar 15, 2026 02:4458,674510,020,472485,999,000999,0002,269,184
9Mar 15, 2026 02:4458,684509,210,140486,077,0001,000,0002,277,376