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 13, 2026 02:24Victor MerckléVictor MerckléScore: 9,331Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 02:249,32786,675,84376,378,0001,038,0002,113,536
2May 13, 2026 02:249,32786,705,97376,375,0001,042,0002,113,536
3May 13, 2026 02:249,33087,096,64976,427,0001,015,0002,113,536
4May 13, 2026 02:249,33184,822,40776,449,0001,004,0002,113,536
5May 13, 2026 02:249,33184,640,19276,446,0001,008,0002,113,536
6May 13, 2026 02:249,33286,942,09376,441,0001,017,0002,113,536
7May 13, 2026 02:249,33685,613,10976,471,0001,025,0002,113,536
8May 13, 2026 02:249,33787,001,17676,471,0001,027,0002,113,536
9May 13, 2026 02:249,36186,697,38776,656,0001,042,0002,113,536