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 21, 2026 13:34Victor MerckléVictor MerckléScore: 4,762Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 13:354,72647,617,38738,187,0001,046,0002,113,536
2May 21, 2026 13:354,72647,066,51838,155,0001,071,0002,113,536
3May 21, 2026 13:354,75447,303,63338,434,0001,030,0002,113,536
4May 21, 2026 13:354,75447,463,08638,445,0001,021,0002,113,536
5May 21, 2026 13:354,76247,943,61938,499,0001,032,0002,113,536
6May 21, 2026 13:354,76349,262,71938,509,0001,028,0002,113,536
7May 21, 2026 13:354,76347,929,77138,470,0001,064,0002,113,536
8May 21, 2026 13:354,77348,189,53938,547,0001,070,0002,113,536
9May 21, 2026 13:354,77947,464,31238,635,0001,037,0002,113,536