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 23:30Nikita SmirnovNikita SmirnovScore: 64,125Success
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 23:3063,952558,695,858474,820,00055,978,0002,281,472
2Feb 7, 2026 23:3063,974554,394,475478,990,00051,998,0002,289,664
3Feb 7, 2026 23:3064,006554,738,419477,225,00054,025,0002,301,952
4Feb 7, 2026 23:3064,114553,773,171470,131,00062,017,0002,281,472
5Feb 7, 2026 23:3064,125554,718,391486,221,00046,020,0002,281,472
6Feb 7, 2026 23:3064,136561,617,330485,298,00047,028,0002,277,376
7Feb 7, 2026 23:3064,169560,588,099460,658,00071,946,0002,281,472
8Feb 7, 2026 23:3064,253558,379,925479,266,00054,030,0002,297,856
9Feb 7, 2026 23:3064,276564,876,335481,541,00051,950,0002,281,472