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:52Victor MerckléVictor MerckléScore: 4,670Success
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:534,64946,724,31637,518,0001,076,0002,113,536
2May 21, 2026 13:534,65046,460,93137,539,0001,056,0002,113,536
3May 21, 2026 13:534,65446,498,47737,545,0001,085,0002,113,536
4May 21, 2026 13:534,66346,678,61037,634,0001,071,0002,113,536
5May 21, 2026 13:534,67048,268,46437,756,0001,007,0002,113,536
6May 21, 2026 13:534,67346,589,46837,707,0001,083,0002,113,536
7May 21, 2026 13:534,68648,502,57837,824,0001,070,0002,113,536
8May 21, 2026 13:534,68746,745,68037,873,0001,034,0002,113,536
9May 21, 2026 13:534,68846,801,20437,907,0001,006,0002,113,536