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 20:01Victor MerckléVictor MerckléScore: 4,628Success
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 20:024,56447,603,83036,813,0001,070,0002,113,536
2May 24, 2026 20:024,58245,870,23937,004,0001,027,0002,113,536
3May 24, 2026 20:024,58445,886,75137,045,0001,009,0002,113,536
4May 24, 2026 20:024,59246,647,00537,033,0001,085,0002,113,536
5May 24, 2026 20:024,62847,147,40637,295,0001,118,0002,113,536
6May 24, 2026 20:024,71648,242,91138,069,0001,076,0002,113,536
7May 24, 2026 20:024,79054,702,51538,712,0001,050,0002,113,536
8May 24, 2026 20:024,79950,509,31838,724,0001,110,0002,113,536
9May 24, 2026 20:024,90856,197,67839,682,0001,055,0002,113,536