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 06:50Andrew EpsteinAndrew EpsteinScore: 33,801Success
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 06:5233,658288,643,930277,347,0002,015,0002,129,920stderr
2Nov 3, 2026 06:5233,668288,678,103277,442,0002,008,0002,125,824stderr
3Nov 3, 2026 06:5233,734289,300,218277,986,0002,009,0002,125,824stderr
4Nov 3, 2026 06:5233,735289,191,186277,993,0002,011,0002,125,824stderr
5Nov 3, 2026 06:5233,801290,337,353278,524,0002,028,0002,125,824stderr
6Nov 3, 2026 06:5233,803290,346,241278,559,0002,011,0002,125,824stderr
7Nov 3, 2026 06:5233,907291,155,521279,422,0002,011,0002,125,824stderr
8Nov 3, 2026 06:5233,919290,735,269279,522,0002,011,0002,129,920stderr
9Nov 3, 2026 06:5233,981291,777,645280,029,0002,014,0002,129,920stderr