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 listFeb 18, 2026 10:10wnwnScore: 7,132Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 18, 2026 10:106,21984,164,68949,590,0002,024,0002,269,184
2Feb 18, 2026 10:106,31973,472,67348,414,0004,034,0002,359,296
3Feb 18, 2026 10:106,32982,678,80750,512,0002,020,0002,285,568
4Feb 18, 2026 10:107,13279,982,44056,185,0003,009,0002,486,272
5Feb 18, 2026 10:107,24782,173,96859,151,0001,002,0002,461,696
6Feb 18, 2026 10:107,25082,784,89858,171,0002,005,0002,310,144