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 03:16Andrew EpsteinAndrew EpsteinScore: 43,675Success
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 03:1743,552370,743,023359,441,0002,042,0002,121,728stderr
2Nov 3, 2026 03:1743,557371,281,324359,508,0002,020,0002,121,728stderr
3Nov 3, 2026 03:1743,615371,815,138359,944,0002,062,0002,121,728stderr
4Nov 3, 2026 03:1743,643371,996,870360,204,0002,039,0002,121,728stderr
5Nov 3, 2026 03:1743,675372,263,235360,468,0002,038,0002,121,728stderr
6Nov 3, 2026 03:1743,723372,134,912360,850,0002,058,0002,121,728stderr
7Nov 3, 2026 03:1743,747372,280,401361,068,0002,037,0002,121,728stderr
8Nov 3, 2026 03:1743,826373,512,704361,705,0002,056,0002,121,728stderr
9Nov 3, 2026 03:1743,844373,917,206361,871,0002,036,0002,121,728stderr