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 20:21Mikołaj UzarskiMikołaj UzarskiScore: 5,449Success
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 20:215,42868,093,60643,050,0002,002,0002,281,472
2Feb 24, 2026 20:225,42873,301,95343,051,0002,002,0002,285,568
3Feb 24, 2026 20:215,43073,339,12643,064,0002,003,0002,281,472
4Feb 24, 2026 20:215,44068,536,96643,150,0002,006,0002,510,848
5Feb 24, 2026 20:215,44971,355,69944,221,0001,005,0002,281,472
6Feb 24, 2026 20:225,45574,007,94743,266,0002,012,0002,281,472
7Feb 24, 2026 20:215,45974,493,80943,300,0002,013,0002,285,568
8Feb 24, 2026 20:225,47069,769,88243,381,0002,017,0002,510,848
9Feb 24, 2026 20:215,51771,404,28744,799,000995,0002,281,472