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 27, 2026 04:19user76135user76135Score: 57,186Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 27, 2026 04:1957,154501,238,597473,379,0001,000,0002,277,376
2Feb 27, 2026 04:1957,180501,453,193473,591,000999,0002,277,376
3Feb 27, 2026 04:1957,180504,542,193473,591,000999,0002,277,376
4Feb 27, 2026 04:1957,184498,904,659473,630,000999,0002,387,968
5Feb 27, 2026 04:1957,186499,483,734473,648,000999,0002,277,376
6Feb 27, 2026 04:1957,190500,369,036473,675,000999,0002,277,376
7Feb 27, 2026 04:1957,224498,392,449473,958,000999,0002,277,376
8Feb 27, 2026 04:1957,247498,062,743474,148,0001,000,0002,260,992
9Feb 27, 2026 04:1957,247500,189,844474,153,0001,000,0002,277,376