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 listJun 29, 2026 07:39Victor MerckléVictor MerckléScore: 4,242Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 29, 2026 07:414,19642,738,26933,832,0001,003,0002,113,536
2Jun 29, 2026 07:414,20442,817,75733,832,0001,062,0002,113,536
3Jun 29, 2026 07:414,21042,826,75933,923,0001,022,0002,113,536
4Jun 29, 2026 07:414,21343,027,19833,904,0001,066,0002,113,536
5Jun 29, 2026 07:414,24243,149,27234,135,0001,080,0002,113,536
6Jun 29, 2026 07:414,31543,745,93534,749,0001,073,0002,113,536
7Jun 29, 2026 07:414,32443,799,54634,896,0001,001,0002,113,536
8Jun 29, 2026 07:414,32843,817,34034,894,0001,033,0002,113,536
9Jun 29, 2026 07:414,33843,936,55235,000,0001,010,0002,113,536