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 00:34Andrew EpsteinAndrew EpsteinScore: 4,082Success
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 00:343,94342,934,28631,613,0001,120,0002,113,536
2Sep 17, 2026 00:344,01543,467,62032,186,0001,142,0002,113,536
3Sep 17, 2026 00:344,03943,706,49832,397,0001,132,0002,113,536
4Sep 17, 2026 00:344,07643,915,79532,698,0001,134,0002,113,536
5Sep 17, 2026 00:344,08244,094,26632,752,0001,129,0002,113,536
6Sep 17, 2026 00:344,08644,043,48332,794,0001,127,0002,113,536
7Sep 17, 2026 00:344,09344,195,58832,835,0001,139,0002,113,536
8Sep 17, 2026 00:344,11444,287,42633,000,0001,147,0002,113,536
9Sep 17, 2026 00:344,12544,359,20033,086,0001,152,0002,113,536