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:22Andrew EpsteinAndrew EpsteinScore: 57,209Success
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:2356,929481,853,144470,511,0002,004,0002,121,728stderr
2Nov 3, 2026 03:2357,130483,905,880472,157,0002,023,0002,121,728stderr
3Nov 3, 2026 03:2357,136483,434,442472,226,0002,006,0002,121,728stderr
4Nov 3, 2026 03:2357,207484,141,392472,820,0002,006,0002,121,728stderr
5Nov 3, 2026 03:2357,209484,660,449472,755,0002,085,0002,121,728stderr
6Nov 3, 2026 03:2357,276484,768,090472,362,0003,036,0002,121,728stderr
7Nov 3, 2026 03:2357,325485,161,066473,794,0002,010,0002,121,728stderr
8Nov 3, 2026 03:2357,879492,669,848478,396,0002,003,0002,121,728stderr
9Nov 3, 2026 03:2359,009509,585,807487,690,0002,086,0002,121,728stderr