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 15, 2026 14:07Mikołaj UzarskiMikołaj UzarskiScore: 6,333Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 15, 2026 14:166,25677,192,55345,936,0005,991,0002,306,048
2Feb 15, 2026 14:166,29075,750,80847,188,0005,020,0002,297,856
3Feb 15, 2026 14:166,29875,007,28547,249,0005,026,0002,498,560
4Feb 15, 2026 14:076,33378,156,13546,501,0006,065,0002,265,088
5Feb 15, 2026 14:076,36180,952,24646,822,0005,977,0002,347,008
6Feb 15, 2026 14:077,10282,979,68152,954,0005,994,0002,420,736