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 listMar 6, 2026 18:20Josu San MartinJosu San MartinScore: 5,139Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 6, 2026 18:204,95260,774,02039,099,0002,005,0002,412,544
2Apr 12, 2026 02:404,98160,104,51840,334,0001,008,0002,408,448
3Mar 6, 2026 18:205,03866,893,79039,828,0001,991,0002,408,448
4Apr 12, 2026 20:265,04067,836,02539,842,0001,992,0002,285,568
5Apr 12, 2026 02:405,05067,573,60539,918,0001,995,0002,285,568
6Apr 12, 2026 20:265,06763,380,13040,054,0002,002,0002,408,448
7Mar 6, 2026 18:205,13968,223,20541,639,0001,015,0002,281,472
8Mar 6, 2026 18:205,14065,945,91141,649,0001,015,0002,404,352
9Mar 6, 2026 18:205,20165,541,64841,161,0002,007,0002,281,472
10Apr 12, 2026 02:405,27667,028,39342,799,000995,0002,285,568
11Apr 12, 2026 20:265,35669,495,69343,446,0001,010,0002,404,352
12Mar 6, 2026 18:205,37477,491,61343,591,0001,013,0002,281,472