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 21:53Mikołaj UzarskiMikołaj UzarskiScore: 5,421Success
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 21:535,41071,002,58143,905,000997,0002,289,664
2Feb 24, 2026 21:535,41367,334,96442,935,0001,996,0002,289,664
3Feb 24, 2026 21:535,41668,667,47642,956,0001,997,0002,285,568
4Feb 24, 2026 21:535,42072,711,01742,984,0001,999,0002,498,560
5Feb 24, 2026 21:535,42168,276,67642,999,0001,999,0002,347,008
6Feb 24, 2026 21:535,42271,037,37943,002,0002,000,0002,285,568
7Feb 24, 2026 21:535,44569,266,57643,189,0002,008,0002,355,200
8Feb 24, 2026 21:535,49675,098,50844,601,0001,013,0002,277,376
9Feb 24, 2026 21:536,08172,896,57748,452,0002,018,0002,269,184