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 23, 2026 14:19Craig BurtonCraig BurtonScore: 88,975Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 23, 2026 14:1988,967747,669,965679,855,00058,575,0002,113,536
2May 23, 2026 14:1988,975747,993,250680,011,00058,486,0002,113,536
3May 23, 2026 14:1989,022749,668,023679,927,00058,959,0002,113,536