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 listApr 26, 2026 05:48olliecrowolliecrowScore: 20,282Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 05:5020,178175,653,444166,476,0001,002,0002,359,296
2Apr 26, 2026 05:5020,214175,963,063165,772,0002,009,0002,355,200
3Apr 26, 2026 05:5020,248175,645,893164,039,0004,025,0002,355,200
4Apr 26, 2026 05:5020,263176,568,227165,181,0003,003,0002,375,680
5Apr 26, 2026 05:5020,282176,501,899166,338,0002,004,0002,371,584
6Apr 26, 2026 05:5020,442176,944,188167,654,0002,019,0002,359,296
7Apr 26, 2026 05:5020,490178,394,489168,068,0002,000,0002,359,296
8Apr 26, 2026 05:5020,499177,345,215168,146,0002,001,0002,351,104
9Apr 26, 2026 05:5020,643191,624,760168,337,0003,006,0002,433,024