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

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 17, 2026 23:286,51176,521,60653,042,0001,000,0002,289,664
2Feb 17, 2026 23:286,51982,870,14452,101,0002,003,0002,277,376
3Feb 17, 2026 23:286,53283,712,36351,206,0003,012,0002,277,376
4Feb 17, 2026 23:286,64384,047,14953,133,0002,005,0002,269,184
5Feb 17, 2026 23:286,82682,158,93656,658,00002,293,760
6Feb 17, 2026 23:286,85278,432,53153,880,0002,993,0002,293,760