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 8, 2026 07:51caandocaandoScore: 8,799Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 8, 2026 07:517,80889,009,93562,816,0001,994,0002,281,472
2Mar 8, 2026 07:517,80990,494,35762,823,0001,994,0002,531,328
3Mar 8, 2026 07:517,88589,339,65463,435,0002,013,0002,281,472
4Mar 8, 2026 07:518,79998,063,75871,032,0002,000,0002,281,472
5Mar 8, 2026 07:518,80297,084,56571,057,0002,001,0002,281,472
6Mar 8, 2026 07:518,845101,018,67672,408,0001,005,0002,527,232