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 21, 2026 15:28Juraj ZelmanJuraj ZelmanScore: 8,303Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 21, 2026 15:288,28992,354,08667,805,000997,0002,359,296
2Feb 21, 2026 15:288,29394,521,15567,838,000997,0002,367,488
3Feb 21, 2026 15:288,29596,028,48067,850,000997,0002,285,568
4Feb 21, 2026 15:288,30396,180,83567,913,000998,0002,293,760
5Feb 21, 2026 15:288,30796,521,14066,947,0001,998,0002,371,584
6Feb 21, 2026 15:288,32294,460,11868,068,0001,001,0002,367,488