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 listAug 11, 2026 11:54Victor MerckléVictor MerckléScore: 3,893Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2026 11:553,83840,141,35530,740,0001,119,0002,117,632stderr
2Aug 11, 2026 11:553,84840,115,04530,833,0001,109,0002,117,632stderr
3Aug 11, 2026 11:553,88240,554,02531,116,0001,111,0002,117,632stderr
4Aug 11, 2026 11:553,88941,838,47531,108,0001,177,0002,117,632stderr
5Aug 11, 2026 11:553,89340,762,66131,179,0001,141,0002,117,632stderr
6Aug 11, 2026 11:553,89840,620,31631,112,0001,248,0002,117,632stderr
7Aug 11, 2026 11:553,90540,625,19131,243,0001,172,0002,117,632stderr
8Aug 11, 2026 11:553,95041,040,59831,570,0001,219,0002,117,632stderr
9Aug 11, 2026 11:554,06242,007,37932,580,0001,137,0002,117,632stderr