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 listMay 18, 2026 01:41Maya RebholzMaya RebholzScore: 111,210Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 18, 2026 01:41110,605927,992,782683,037,000234,990,0002,113,536
2May 18, 2026 01:41110,661930,318,577682,348,000236,142,0002,113,536
3May 18, 2026 01:41111,120931,571,331682,820,000239,482,0002,113,536
4May 18, 2026 01:41111,167932,014,475682,688,000240,001,0002,113,536
5May 18, 2026 01:41111,210933,375,076682,232,000240,815,0002,113,536
6May 18, 2026 01:41111,229934,750,477682,318,000240,887,0002,113,536
7May 18, 2026 01:41111,432935,753,978682,051,000242,841,0002,113,536
8May 18, 2026 01:41111,491934,595,929682,618,000242,761,0002,113,536
9May 18, 2026 01:41111,913940,616,959682,377,000246,504,0002,113,536