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 listJun 26, 2026 08:38Victor MerckléVictor MerckléScore: 10,289Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 26, 2026 08:406,38060,617,29145,042,0007,917,0002,113,536
2Jun 26, 2026 08:406,40760,768,57845,416,0007,767,0002,113,536
3Jun 26, 2026 08:4010,20492,496,67776,778,0007,921,0002,113,536
4Jun 26, 2026 08:4010,24292,672,68977,396,0007,615,0002,113,536
5Jun 26, 2026 08:4010,28993,790,60577,466,0007,935,0002,113,536
6Jun 26, 2026 08:4010,33193,367,64277,468,0008,282,0002,113,536
7Jun 26, 2026 08:4010,36793,714,76778,136,0007,911,0002,113,536
8Jun 26, 2026 08:4010,45094,795,86279,005,0007,733,0002,113,536
9Jun 26, 2026 08:4010,52695,360,41079,357,0008,010,0002,113,536