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 14, 2026 08:09Daniel MastalerzDaniel MastalerzScore: 6,873Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 14, 2026 08:096,75582,643,61350,060,0006,007,0002,494,464
2Feb 14, 2026 08:096,80076,635,06351,398,0005,039,0002,293,760
3Feb 14, 2026 08:096,81082,227,52451,479,0005,047,0002,285,568
4Feb 14, 2026 08:096,87379,164,65151,042,0006,004,0002,506,752
5Feb 14, 2026 08:096,90881,656,02352,305,0005,029,0002,379,776
6Feb 14, 2026 08:096,94686,307,66451,583,0006,068,0002,494,464