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 07:09Andrew EpsteinAndrew EpsteinScore: 10,163Success
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 07:1410,07193,229,51381,393,0002,204,0002,121,728stderr
2Nov 3, 2026 07:1410,13893,709,45681,915,0002,232,0002,121,728stderr
3Nov 3, 2026 07:1410,14393,440,07382,169,0002,019,00028,672stderr
4Nov 3, 2026 07:1410,14493,811,32782,015,0002,181,0002,121,728stderr
5Nov 3, 2026 07:1410,16394,042,51781,295,0003,065,0002,121,728stderr
6Nov 3, 2026 07:1410,18593,797,70882,121,0002,416,0002,121,728stderr
7Nov 3, 2026 07:1410,22294,086,12381,745,0003,101,00024,576stderr
8Nov 3, 2026 07:1410,22494,158,07881,984,0002,883,00024,576stderr
9Nov 3, 2026 07:1410,25794,438,27282,240,0002,898,00024,576stderr