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 16, 2026 00:48Victor MerckléVictor MerckléScore: 6,952Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 00:526,94667,840,06057,654,00002,113,536
2May 16, 2026 00:526,94767,598,99756,618,0001,044,0002,113,536
3May 16, 2026 00:526,94866,679,34456,674,0001,002,0002,113,536
4May 16, 2026 00:526,95166,742,89757,696,00002,113,536
5May 16, 2026 00:526,95266,557,51256,665,0001,044,0002,113,536
6May 16, 2026 00:526,95267,754,56056,687,0001,017,0002,113,536
7May 16, 2026 00:526,95264,979,16157,702,00002,113,536
8May 16, 2026 00:526,96767,312,94856,831,0001,001,0002,113,536
9May 16, 2026 00:527,07968,144,62357,751,0001,007,0002,113,536