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 listSep 24, 2026 18:31Karthik ReddyKarthik ReddyScore: 68,218Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 18:3167,407569,714,159558,409,0001,071,0002,113,536
2Sep 24, 2026 18:3167,411569,773,837558,444,0001,072,0002,113,536
3Sep 24, 2026 18:3167,438570,141,737558,661,0001,081,0002,113,536
4Sep 24, 2026 18:3168,205577,679,719565,101,0001,002,0002,113,536
5Sep 24, 2026 18:3168,218576,621,094564,121,0002,091,0002,113,536
6Sep 24, 2026 18:3168,592580,278,010568,210,0001,104,0002,113,536
7Sep 24, 2026 18:3168,600579,713,923568,206,0001,176,0002,113,536
8Sep 24, 2026 18:3168,604579,658,148568,304,0001,111,0002,113,536
9Sep 24, 2026 18:3168,642580,065,676568,633,0001,096,0002,113,536