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 listSep 17, 2026 02:32Andrew EpsteinAndrew EpsteinScore: 81,411Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 17, 2026 02:3281,140683,708,467672,463,0001,001,0002,117,632stderr
2Sep 17, 2026 02:3281,187684,159,559672,851,0001,005,0002,117,632stderr
3Sep 17, 2026 02:3281,213684,235,213673,064,0001,006,0002,117,632stderr
4Sep 17, 2026 02:3281,373685,744,613674,378,0001,023,0002,117,632stderr
5Sep 17, 2026 02:3281,411685,924,114674,685,0001,032,0002,117,632stderr
6Sep 17, 2026 02:3281,465686,545,402673,999,0002,162,0002,117,632stderr
7Sep 17, 2026 02:3281,514686,809,570675,570,0001,003,0002,117,632stderr
8Sep 17, 2026 02:3281,548687,030,272675,840,0001,012,0002,117,632stderr
9Sep 17, 2026 02:3281,641687,841,340676,621,0001,003,0002,117,632stderr