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 21, 2026 21:35M-RochatM-RochatScore: 6,740Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 21:356,71565,131,29853,696,0002,043,0002,113,536
2May 21, 2026 21:356,72365,223,86653,741,0002,060,0002,113,536
3May 21, 2026 21:356,72665,226,56353,780,0002,052,0002,113,536
4May 21, 2026 21:356,73765,826,45553,869,0002,050,0002,113,536
5May 21, 2026 21:356,74066,278,32753,892,0002,054,0002,113,536
6May 21, 2026 21:356,75467,323,16153,992,0002,067,0002,113,536
7May 21, 2026 21:356,76265,549,45054,060,0002,072,0002,113,536
8May 21, 2026 21:356,80167,057,62354,372,0002,078,0002,113,536
9May 21, 2026 21:356,80665,968,16054,442,0002,054,0002,113,536