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 listMay 19, 2026 07:22Victor MerckléVictor MerckléScore: 7,882Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 19, 2026 07:237,83474,666,41363,987,0001,042,0002,113,536
2May 19, 2026 07:237,85275,890,43364,162,0001,014,0002,113,536
3May 19, 2026 07:237,86175,176,60164,161,0001,087,0002,113,536
4May 19, 2026 07:237,86573,039,43564,279,0001,007,0002,113,536
5May 19, 2026 07:237,88273,091,16164,399,0001,026,0002,113,536
6May 19, 2026 07:237,91773,482,37864,678,0001,035,0002,113,536
7May 19, 2026 07:237,96975,177,34365,144,0001,001,0002,113,536
8May 19, 2026 07:237,98075,626,75665,216,0001,018,0002,113,536
9May 19, 2026 07:237,98774,055,29265,253,0001,042,0002,113,536