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 21, 2026 23:13Juraj ZelmanJuraj ZelmanScore: 7,506Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 21, 2026 23:137,24781,580,99359,148,0001,002,0002,363,392
2Feb 21, 2026 23:137,42893,827,15060,644,0001,010,0002,363,392
3Feb 21, 2026 23:137,44894,592,57161,816,00002,277,376
4Feb 21, 2026 23:137,50685,951,60358,280,0004,019,0002,281,472
5Feb 21, 2026 23:137,51786,107,76061,386,0001,006,0002,289,664
6Feb 21, 2026 23:137,73493,193,07063,191,0001,003,0002,281,472