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 20, 2026 10:36M-RochatM-RochatScore: 6,854Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 10:366,72966,707,32353,792,0002,065,0002,113,536
2May 20, 2026 10:366,73566,896,91553,837,0002,069,0002,113,536
3May 20, 2026 10:366,84266,977,75054,630,0002,161,0002,113,536
4May 20, 2026 10:366,84467,826,11954,638,0002,174,0002,113,536
5May 20, 2026 10:366,85466,774,75054,742,0002,150,0002,113,536
6May 20, 2026 10:366,85768,618,78254,736,0002,185,0002,113,536
7May 20, 2026 10:366,86466,983,67854,803,0002,176,0002,113,536
8May 20, 2026 10:366,88368,047,43454,770,0002,365,0002,113,536
9May 20, 2026 10:366,89669,804,77954,855,0002,385,0002,113,536