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 21, 2026 14:05Daniel MastalerzDaniel MastalerzScore: 5,727Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 21, 2026 14:055,72070,189,81144,449,0003,030,0002,510,848
2Feb 21, 2026 14:055,72772,639,46345,512,0002,022,0002,289,664
3Feb 21, 2026 14:055,74173,343,75846,638,0001,013,0002,510,848