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 listAug 28, 2026 05:24Victor MerckléVictor MerckléScore: 52,048Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2026 05:2552,034440,266,222430,826,0001,061,0002,113,536
2Aug 28, 2026 05:2552,044440,438,407430,967,0001,001,0002,113,536
3Aug 28, 2026 05:2552,044440,393,539430,831,0001,141,0002,113,536
4Aug 28, 2026 05:2552,045440,594,412430,966,0001,011,0002,113,536
5Aug 28, 2026 05:2552,048440,425,591430,940,0001,064,0002,113,536
6Aug 28, 2026 05:2552,057440,494,474431,012,0001,067,0002,113,536
7Aug 28, 2026 05:2552,060440,459,543431,041,0001,061,0002,113,536
8Aug 28, 2026 05:2552,063440,815,368431,060,0001,068,0002,113,536
9Aug 28, 2026 05:2552,065440,608,361431,026,0001,115,0002,113,536