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 listFeb 19, 2026 23:28Daniel MastalerzDaniel MastalerzScore: 6,601Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 19, 2026 23:286,49475,019,58849,905,0003,992,0002,273,280
2Feb 19, 2026 23:286,49882,476,49149,938,0003,995,0002,330,624
3Feb 19, 2026 23:286,50683,370,75850,001,0004,000,0002,273,280
4Feb 19, 2026 23:286,60179,675,08750,807,0003,984,0002,269,184
5Feb 19, 2026 23:286,61278,460,45151,890,0002,993,0002,265,088
6Feb 19, 2026 23:286,61377,544,94452,891,0001,995,0002,277,376