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 listNov 3, 2026 13:11Andrew EpsteinAndrew EpsteinScore: 59,716Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 3, 2026 13:1659,411502,430,538487,923,0005,191,0002,125,824stderr
2Nov 3, 2026 13:1659,586503,893,298489,813,0004,755,0002,121,728stderr
3Nov 3, 2026 13:1659,602504,190,844488,948,0005,751,0002,125,824stderr
4Nov 3, 2026 13:1659,629504,285,909489,429,0005,497,0002,125,824stderr
5Nov 3, 2026 13:1659,716504,923,521490,042,0005,603,0002,121,728stderr
6Nov 3, 2026 13:1659,780505,441,117491,251,0004,930,0002,125,824stderr
7Nov 3, 2026 13:1659,967507,169,912491,059,0006,675,0002,125,824stderr
8Nov 3, 2026 13:1660,027507,569,323491,276,0006,950,0002,125,824stderr
9Nov 3, 2026 13:1660,033507,431,071491,543,0006,738,0002,125,824stderr