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 listApr 27, 2026 04:58wnwnScore: 3,463Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 04:593,39742,386,91826,182,0002,014,0002,486,272
2Apr 27, 2026 04:593,40046,947,22627,217,0001,008,0002,486,272
3Apr 27, 2026 04:593,44348,346,90627,560,0001,020,0002,482,176
4Apr 27, 2026 04:593,44945,131,07127,612,0001,022,0002,478,080
5Apr 27, 2026 04:593,46340,919,53227,719,0001,026,0002,494,464
6Apr 27, 2026 04:593,57651,157,56929,687,00002,330,624
7Apr 27, 2026 04:593,58647,196,68127,782,0001,984,0002,486,272
8Apr 27, 2026 04:593,62949,606,66130,124,00002,490,368
9Apr 27, 2026 04:593,67046,302,77529,450,0001,015,0002,478,080