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 20, 2026 18:11Victor MerckléVictor MerckléScore: 4,874Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 18:114,86648,270,52739,361,0001,035,0002,113,536
2May 20, 2026 18:114,86950,139,94839,416,0001,004,0002,113,536
3May 20, 2026 18:114,86949,441,17339,416,0001,001,0002,113,536
4May 20, 2026 18:114,87048,203,51139,416,0001,011,0002,113,536
5May 20, 2026 18:114,87449,646,56939,436,0001,025,0002,113,536
6May 20, 2026 18:114,87648,613,04539,455,0001,019,0002,113,536
7May 20, 2026 18:114,89150,225,59639,561,0001,036,0002,113,536
8May 20, 2026 18:114,89548,435,60039,611,0001,024,0002,113,536
9May 20, 2026 18:114,96449,041,35840,202,0001,003,0002,113,536