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 listMar 24, 2026 04:43servant714servant714Score: 68,028Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 24, 2026 04:4367,912588,044,528520,697,00042,975,0002,281,472
2Mar 24, 2026 04:4367,913586,317,974508,708,00054,968,0002,273,280
3Mar 24, 2026 04:4367,944585,463,332495,944,00067,992,0002,273,280
4Mar 24, 2026 04:4368,006596,855,519494,395,00070,055,0002,281,472
5Mar 24, 2026 04:4368,028591,893,667504,563,00060,067,0002,281,472
6Mar 24, 2026 04:4368,041589,752,055487,773,00076,964,0002,396,160
7Mar 24, 2026 04:4368,046586,801,232484,811,00079,968,0002,404,352
8Mar 24, 2026 04:4368,089590,338,491498,120,00067,016,0002,387,968
9Mar 24, 2026 04:4368,182589,376,744491,923,00073,988,0002,273,280