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 listApr 23, 2026 01:35Charles CabergsCharles CabergsScore: 20,145Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 23, 2026 01:3820,116186,245,850163,966,0002,999,0002,523,136
2Apr 23, 2026 01:3820,133181,475,454164,108,0003,001,0002,519,040
3Apr 23, 2026 01:3820,135182,498,120165,127,0002,001,0002,510,848
4Apr 23, 2026 01:3820,138181,791,725164,149,0003,002,0002,514,944
5Apr 23, 2026 01:3820,145185,576,706165,207,0002,002,0002,527,232
6Apr 23, 2026 01:3820,146185,246,757164,217,0003,003,0002,519,040
7Apr 23, 2026 01:3820,791191,102,424170,561,0002,006,0002,531,328
8Apr 23, 2026 01:3820,948194,152,372171,875,0001,998,0002,514,944
9Apr 23, 2026 01:3820,958194,902,950170,954,0002,999,0002,338,816