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 15, 2026 12:33Daniel MastalerzDaniel MastalerzScore: 7,332Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 15, 2026 12:337,20488,027,49756,806,0002,989,0002,301,952
2Feb 15, 2026 12:337,20593,768,37857,806,0001,993,0002,269,184
3Feb 15, 2026 12:337,25384,093,46157,187,0003,009,0002,371,584
4Feb 15, 2026 12:337,33284,324,51858,860,0001,995,0002,265,088
5Feb 15, 2026 12:337,33480,684,22059,879,000997,0002,293,760
6Feb 15, 2026 12:337,37890,917,02259,233,0002,007,0002,293,760