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 7, 2026 15:19Kevin PetersKevin PetersScore: 73,961Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 15:1973,828624,055,160554,828,00057,950,0002,113,536
2Sep 7, 2026 15:1973,835622,731,577555,017,00057,821,0002,113,536
3Sep 7, 2026 15:1973,855623,678,389555,615,00057,389,0002,113,536
4Sep 7, 2026 15:1973,891624,049,363555,151,00058,145,0002,113,536
5Sep 7, 2026 15:1973,961624,456,408555,465,00058,417,0002,113,536
6Sep 7, 2026 15:1974,032625,080,726556,351,00058,118,0002,113,536
7Sep 7, 2026 15:1974,054625,426,487556,921,00057,730,0002,113,536
8Sep 7, 2026 15:1975,658640,063,558570,301,00057,661,0002,113,536
9Sep 7, 2026 15:1976,689646,460,084577,498,00059,024,0002,113,536