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 02:48Victor MerckléVictor MerckléScore: 5,122Success
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 02:495,09050,283,68541,185,0001,069,0002,113,536
2Jun 29, 2026 02:495,10050,379,62841,246,0001,086,0002,113,536
3Jun 29, 2026 02:495,10150,323,31741,267,0001,077,0002,113,536
4Jun 29, 2026 02:495,10750,311,50541,305,0001,091,0002,113,536
5Jun 29, 2026 02:495,12250,424,96641,506,0001,011,0002,113,536
6Jun 29, 2026 02:495,12250,394,93541,508,0001,010,0002,113,536
7Jun 29, 2026 02:495,13151,758,67141,489,0001,104,0002,113,536
8Jun 29, 2026 02:495,13250,493,20441,525,0001,072,0002,113,536
9Jun 29, 2026 02:495,38052,546,63943,621,0001,034,0002,113,536