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 listFeb 7, 2026 18:53Benn TanBenn TanScore: 9,801Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 7, 2026 18:538,10088,330,67866,225,0001,003,0002,408,448
2Feb 7, 2026 18:538,18293,453,08166,911,000998,0002,510,848
3Feb 7, 2026 18:538,18695,273,48066,946,000999,0002,510,848
4Feb 7, 2026 18:539,801105,374,18880,345,0001,004,0002,392,064
5Feb 7, 2026 18:5310,117112,081,27482,971,000999,0002,514,944
6Feb 7, 2026 18:5310,149111,232,69783,234,0001,002,0002,265,088