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 20:39Mikołaj UzarskiMikołaj UzarskiScore: 6,143Success
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 20:396,00082,348,33644,824,0004,980,0002,498,560
2Feb 19, 2026 20:436,00279,163,06746,830,0002,989,0002,404,352
3Feb 19, 2026 20:396,12076,119,67644,818,0005,975,0002,269,184
4Feb 19, 2026 20:396,14376,302,34643,993,0006,998,0002,478,080
5Feb 19, 2026 20:436,14975,645,38146,033,0005,003,0002,441,216
6Feb 19, 2026 20:436,15978,074,28245,104,0006,013,0002,510,848