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:17Andrew EpsteinAndrew EpsteinScore: 69,806Success
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:1769,707588,354,821576,565,0002,004,0002,121,728stderr
2Nov 3, 2026 06:1769,717588,060,216576,645,0002,009,0002,121,728stderr
3Nov 3, 2026 06:1769,743588,263,311576,861,0002,011,0002,121,728stderr
4Nov 3, 2026 06:1769,782588,918,059577,190,0002,004,0002,121,728stderr
5Nov 3, 2026 06:1769,806589,120,735577,348,0002,050,0002,121,728stderr
6Nov 3, 2026 06:1769,904590,076,241578,207,0002,004,0002,121,728stderr
7Nov 3, 2026 06:1770,037590,710,807579,304,0002,011,0002,121,728stderr
8Nov 3, 2026 06:1770,084591,009,631579,700,0002,003,0002,121,728stderr
9Nov 3, 2026 06:1770,179592,261,786580,486,0002,003,0002,121,728stderr