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 listMay 11, 2026 07:56wnwnScore: 3,604Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 07:573,42436,335,06627,303,0001,124,0002,113,536
2May 11, 2026 07:573,58937,842,96128,658,0001,132,0002,113,536
3May 11, 2026 07:573,59237,576,08528,686,0001,129,0002,113,536
4May 11, 2026 07:573,59838,156,03128,746,0001,124,0002,113,536
5May 11, 2026 07:573,60439,591,29728,815,0001,102,0002,113,536
6May 11, 2026 07:573,60839,393,28628,860,0001,090,0002,113,536
7May 11, 2026 07:573,61539,092,88328,897,0001,112,0002,113,536
8May 11, 2026 07:573,62339,724,91828,955,0001,120,0002,113,536
9May 11, 2026 07:573,62739,109,16129,000,0001,108,0002,113,536