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 7, 2026 17:30Benn TanBenn TanScore: 21,258Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 7, 2026 17:3021,203205,001,832174,983,000999,0002,281,472
2Feb 7, 2026 17:3021,207202,166,407176,019,00002,482,176
3Feb 7, 2026 17:3021,216208,822,434173,092,0003,001,0002,478,080
4Feb 7, 2026 17:3021,240201,617,555174,285,0002,003,0002,281,472
5Feb 7, 2026 17:3021,258202,916,676175,437,0001,002,0002,314,240
6Feb 7, 2026 17:3021,261203,944,817174,464,0002,005,0002,289,664
7Feb 7, 2026 17:3021,263208,760,687175,481,0001,002,0002,473,984
8Feb 7, 2026 17:3021,267209,186,558174,511,0002,005,0002,281,472
9Feb 7, 2026 17:3021,267203,594,640174,508,0002,005,0002,281,472