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:20caandocaandoScore: 5,321Success
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:205,30768,184,27242,050,0002,002,0002,285,568
2Mar 2, 2026 15:205,30870,522,03942,056,0002,002,0002,285,568
3Mar 2, 2026 15:205,31368,562,09842,093,0002,004,0002,285,568
4Mar 2, 2026 15:205,31371,855,92242,090,0002,004,0002,285,568
5Mar 2, 2026 15:205,31766,244,79242,124,0002,005,0002,289,664
6Mar 2, 2026 15:205,32165,787,09942,156,0002,007,0002,527,232
7Mar 2, 2026 15:205,32171,342,11542,155,0002,007,0002,285,568
8Mar 2, 2026 15:205,33072,263,15841,219,0003,016,0002,285,568
9Mar 2, 2026 15:205,33667,108,76942,279,0002,013,0002,285,568
10Mar 2, 2026 15:205,40566,572,76942,871,0001,994,0002,260,992
11Mar 2, 2026 15:205,41765,466,54142,965,0001,998,0002,285,568
12Mar 2, 2026 15:205,42166,580,02442,997,0001,999,0002,285,568