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 24, 2026 11:11Victor MerckléVictor MerckléScore: 4,615Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 24, 2026 11:124,58146,190,78236,939,0001,091,0002,113,536
2May 24, 2026 11:124,58446,618,50437,052,0001,002,0002,113,536
3May 24, 2026 11:124,59747,435,40337,152,0001,007,0002,113,536
4May 24, 2026 11:124,59746,153,62237,109,0001,047,0002,113,536
5May 24, 2026 11:124,61546,633,71637,272,0001,038,0002,113,536
6May 24, 2026 11:124,61946,464,70537,335,0001,009,0002,113,536
7May 24, 2026 11:124,62847,903,62737,362,0001,057,0002,113,536
8May 24, 2026 11:124,76747,973,65238,529,0001,038,0002,113,536
9May 24, 2026 11:124,83148,600,56839,074,0001,027,0002,113,536