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 01:32Andrew EpsteinAndrew EpsteinScore: 52,212Success
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 01:3351,966441,599,356430,323,0001,003,0002,117,632stderr
2Sep 17, 2026 01:3351,974441,577,653430,380,0001,005,0002,117,632stderr
3Sep 17, 2026 01:3352,129442,833,528431,674,0001,001,0002,117,632stderr
4Sep 17, 2026 01:3352,207443,545,271432,313,0001,006,0002,117,632stderr
5Sep 17, 2026 01:3352,212443,793,939432,359,0001,003,0002,117,632stderr
6Sep 17, 2026 01:3352,265444,172,396432,800,0001,004,0002,117,632stderr
7Sep 17, 2026 01:3352,304444,319,540433,126,0001,005,0002,117,632stderr
8Sep 17, 2026 01:3352,309444,356,588433,164,0001,008,0002,117,632stderr
9Sep 17, 2026 01:3352,317444,520,366433,226,0001,007,0002,117,632stderr