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 24, 2026 19:49Mikołaj UzarskiMikołaj UzarskiScore: 6,136Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 24, 2026 19:496,12678,736,31548,849,0001,993,0002,285,568
2Feb 24, 2026 19:496,13074,311,80048,887,0001,995,0002,285,568
3Feb 24, 2026 19:496,13274,060,71348,903,0001,996,0002,510,848
4Feb 24, 2026 19:496,13673,975,84548,933,0001,997,0002,281,472
5Feb 24, 2026 19:496,14583,057,73049,003,0002,000,0002,506,752
6Feb 24, 2026 19:496,19887,482,03148,418,0003,026,0002,506,752