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 listSep 6, 2025 21:54Yaga-YoinkYaga-YoinkScore: 2,069,796Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 6, 2025 21:542,065,03217,180,261,89517,078,796,00060,967,0002,277,376
2Sep 6, 2025 21:542,065,66617,175,953,99017,075,063,00069,967,0002,289,664
3Sep 6, 2025 21:542,066,65517,189,705,69617,100,267,00052,972,0002,277,376
4Sep 6, 2025 21:542,068,15517,205,481,36917,110,712,00054,973,0002,277,376
5Sep 6, 2025 21:542,069,79617,212,268,88417,118,342,00060,965,0002,519,040
6Sep 6, 2025 21:542,070,05017,217,775,00317,102,459,00078,960,0002,277,376
7Sep 6, 2025 21:542,070,59617,221,112,54517,114,989,00070,958,0002,510,848
8Sep 6, 2025 21:542,073,60017,242,051,69717,137,913,00072,965,0002,277,376
9Sep 6, 2025 21:542,107,91017,538,645,06517,446,680,00048,976,0002,277,376