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 listFeb 26, 2026 21:24Daniel MastalerzDaniel MastalerzScore: 5,619Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 26, 2026 21:245,51873,870,28043,805,0001,991,0002,289,664
2Feb 26, 2026 21:245,51972,249,44444,815,000995,0002,420,736
3Feb 26, 2026 21:245,52566,333,60442,868,0002,990,0002,281,472
4Feb 26, 2026 21:245,61973,604,95744,611,0002,027,0002,285,568
5Feb 26, 2026 21:245,64074,484,35943,821,0002,987,0002,420,736
6Feb 26, 2026 21:245,65271,154,78343,920,0002,994,0002,285,568