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 19, 2026 01:10Josu San MartinJosu San MartinScore: 6,446Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 19, 2026 01:106,15972,700,77748,115,0003,007,0002,404,352
2Feb 19, 2026 01:106,25079,680,06249,877,0001,995,0002,408,448
3Feb 19, 2026 01:106,42780,973,91353,343,00002,510,848
4Feb 19, 2026 01:106,44673,581,30953,499,00002,326,528
5Feb 19, 2026 01:106,44976,502,64452,518,0001,009,0002,420,736
6Feb 19, 2026 01:106,82185,440,64453,582,0003,032,0002,514,944