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 24, 2026 21:40wnwnScore: 4,434Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 25, 2026 20:494,38759,475,00435,397,0001,011,0002,273,280
2Feb 24, 2026 21:404,41062,293,96135,589,0001,016,0002,273,280
3Feb 25, 2026 20:494,41063,551,64935,584,0001,016,0002,273,280
4Feb 24, 2026 21:404,43463,588,74234,810,0001,989,0002,490,368
5Feb 25, 2026 20:494,44964,878,50634,931,0001,996,0002,535,424
6Feb 24, 2026 21:404,48065,138,45035,173,0002,009,0002,273,280