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 listJul 6, 2026 13:56Teow Hua JunTeow Hua JunScore: 11,613Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 14:0211,593105,643,24795,010,0001,216,0002,117,632
2Jul 6, 2026 14:0211,601105,556,83295,093,0001,199,0002,113,536
3Jul 6, 2026 14:0211,604105,780,00395,112,0001,203,0002,113,536
4Jul 6, 2026 14:0211,605105,694,46195,190,0001,139,0002,113,536
5Jul 6, 2026 14:0211,613105,803,56295,189,0001,205,0002,113,536
6Jul 6, 2026 14:0211,620105,802,11495,240,0001,214,0002,113,536
7Jul 6, 2026 14:0211,624105,886,46695,331,0001,151,0002,113,536
8Jul 6, 2026 14:0211,631105,999,85595,338,0001,206,0002,113,536
9Jul 6, 2026 14:0211,632106,009,49795,324,0001,227,0002,113,536