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 19:51Mikołaj UzarskiMikołaj UzarskiScore: 5,810Success
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 19:545,70768,969,19841,322,0006,047,0002,404,352
2Feb 15, 2026 19:545,78073,311,05041,974,0005,996,0002,428,928
3Feb 15, 2026 19:565,78771,387,85341,029,0007,004,0002,269,184
4Feb 15, 2026 19:565,81075,765,43042,193,0006,027,0002,416,640
5Feb 15, 2026 19:545,82673,478,03943,321,0005,037,0002,490,368
6Feb 15, 2026 19:565,84776,597,01640,442,0008,088,0002,281,472