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 08:33Andrew EpsteinAndrew EpsteinScore: 105,100Success
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 08:34104,906880,606,855867,536,0003,190,0002,121,728stderr
2Nov 3, 2026 08:34104,953880,920,978867,787,0003,325,0002,121,728stderr
3Nov 3, 2026 08:34105,007881,422,495868,460,0003,105,0002,121,728stderr
4Nov 3, 2026 08:34105,098882,097,441870,231,0002,088,0002,121,728stderr
5Nov 3, 2026 08:34105,100881,722,954869,202,0003,129,0002,121,728stderr
6Nov 3, 2026 08:34105,115881,704,038869,368,0003,093,0002,121,728stderr
7Nov 3, 2026 08:34105,204883,020,367871,128,0002,071,0002,121,728stderr
8Nov 3, 2026 08:34105,213883,122,518870,194,0003,075,0002,121,728stderr
9Nov 3, 2026 08:34105,247883,371,120871,475,0002,078,0002,121,728stderr