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 2, 2026 15:29caandocaandoScore: 5,920Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 2, 2026 15:295,82570,323,90046,332,0002,014,0002,523,136
2Mar 2, 2026 15:295,82678,587,83048,356,00002,269,184
3Mar 2, 2026 15:295,86879,949,32847,714,000994,0002,285,568
4Mar 2, 2026 15:295,92076,862,43548,138,0001,002,0002,285,568
5Mar 2, 2026 15:295,93175,888,02647,222,0002,009,0002,285,568
6Mar 2, 2026 15:295,94771,878,72547,350,0002,014,0002,265,088