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:26Andrew EpsteinAndrew EpsteinScore: 71,018Success
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:2770,466596,037,897581,709,0003,163,0002,117,632stderr
2Sep 17, 2026 02:2770,866599,237,442585,190,0003,003,0002,121,728stderr
3Sep 17, 2026 02:2770,933599,849,642585,635,0003,111,0002,117,632stderr
4Sep 17, 2026 02:2770,977599,456,921585,926,0003,188,0002,121,728stderr
5Sep 17, 2026 02:2771,018600,397,897586,265,0003,187,0002,121,728stderr
6Sep 17, 2026 02:2771,019599,943,972586,359,0003,100,0002,117,632stderr
7Sep 17, 2026 02:2771,114601,341,752586,977,0003,272,0002,121,728stderr
8Sep 17, 2026 02:2771,201603,322,649587,636,0003,335,0002,121,728stderr
9Sep 17, 2026 02:2771,206601,531,485588,006,0003,005,0002,121,728stderr