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 19, 2026 10:02Victor MerckléVictor MerckléScore: 6,086Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 19, 2026 10:036,05561,236,31949,238,0001,026,0002,113,536
2May 19, 2026 10:036,05961,078,10949,269,0001,026,0002,113,536
3May 19, 2026 10:036,06261,143,99449,291,0001,028,0002,113,536
4May 19, 2026 10:036,07058,458,65349,368,0001,016,0002,113,536
5May 19, 2026 10:036,08659,448,02849,505,0001,016,0002,113,536
6May 19, 2026 10:036,15160,853,09150,029,0001,030,0002,113,536
7May 19, 2026 10:036,21061,163,15250,439,0001,110,0002,113,536
8May 19, 2026 10:036,23960,400,57250,705,0001,084,0002,113,536
9May 19, 2026 10:036,41361,398,68251,155,0002,073,0002,113,536