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 listJul 19, 2026 16:52Adam FolwarcznyAdam FolwarcznyScore: 40,250Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 19, 2026 16:5340,225343,608,730332,866,0001,003,0002,113,536
2Jul 19, 2026 16:5340,237343,783,089332,970,0001,005,0002,113,536
3Jul 19, 2026 16:5340,238343,771,067332,972,0001,005,0002,113,536
4Jul 19, 2026 16:5340,244343,760,859332,017,0002,013,0002,113,536
5Jul 19, 2026 16:5340,250344,001,524333,071,0001,004,0002,113,536
6Jul 19, 2026 16:5340,252343,893,873333,090,0001,003,0002,113,536
7Jul 19, 2026 16:5340,264344,187,422332,182,0002,011,0002,113,536
8Jul 19, 2026 16:5340,268344,068,770333,223,0001,005,0002,113,536
9Jul 19, 2026 16:5341,058351,303,671338,772,0002,014,0002,113,536