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 14, 2026 05:04Victor MerckléVictor MerckléScore: 7,003Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 14, 2026 05:056,99866,380,41357,076,0001,012,0002,113,536
2May 14, 2026 05:056,99965,371,38957,094,0001,004,0002,113,536
3May 14, 2026 05:057,00068,936,44557,074,0001,034,0002,113,536
4May 14, 2026 05:057,00165,598,39157,066,0001,043,0002,113,536
5May 14, 2026 05:057,00367,684,18657,079,0001,048,0002,113,536
6May 14, 2026 05:057,00465,771,78457,124,0001,011,0002,113,536
7May 14, 2026 05:057,00665,586,95957,117,0001,035,0002,113,536
8May 14, 2026 05:057,00668,436,82557,138,0001,020,0002,113,536
9May 14, 2026 05:057,11666,489,25759,064,00002,113,536