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 16, 2026 03:53Victor MerckléVictor MerckléScore: 6,967Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 03:536,94765,676,51257,666,00002,113,536
2May 16, 2026 03:536,95064,987,99256,678,0001,010,0002,113,536
3May 16, 2026 03:536,95365,066,89256,694,0001,017,0002,113,536
4May 16, 2026 03:536,95467,148,75656,696,0001,024,0002,113,536
5May 16, 2026 03:536,96766,379,17956,802,0001,029,0002,113,536
6May 16, 2026 03:537,01465,514,31857,197,0001,027,0002,113,536
7May 16, 2026 03:537,01766,451,77557,225,0001,022,0002,113,536
8May 16, 2026 03:537,01865,597,27457,223,0001,031,0002,113,536
9May 16, 2026 03:537,11066,487,53158,002,0001,012,0002,113,536