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:15Mikołaj UzarskiMikołaj UzarskiScore: 6,028Success
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:156,01684,853,95947,934,0001,997,0002,289,664
2Feb 24, 2026 21:166,01680,301,18447,938,0001,997,0002,355,200
3Feb 24, 2026 21:166,01677,764,06848,935,000998,0002,281,472
4Feb 24, 2026 21:156,02871,696,10249,031,0001,000,0002,510,848
5Feb 24, 2026 21:156,03276,276,10048,065,0002,002,0002,285,568
6Feb 24, 2026 21:166,03977,182,67448,119,0002,004,0002,281,472