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 23, 2026 21:20Elijah KinElijah KinScore: 68,657Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 23, 2026 21:2068,481594,887,508568,390,00002,523,136
2Mar 23, 2026 21:2068,534593,891,048567,834,000999,0002,260,992
3Mar 23, 2026 21:2068,607614,122,018567,447,0001,994,0002,519,040
4Mar 23, 2026 21:2068,657600,364,002568,855,000999,0002,379,776
5Mar 23, 2026 21:2070,587612,995,063584,870,000999,0002,523,136
6Mar 23, 2026 21:2070,671624,928,242586,568,00002,514,944