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 19, 2026 16:31Daniel MastalerzDaniel MastalerzScore: 6,243Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 19, 2026 16:316,24279,220,37148,819,0002,988,0002,527,232
2Feb 19, 2026 16:316,24380,818,54048,832,0002,989,0002,306,048
3Feb 19, 2026 16:316,26675,165,65848,010,0004,000,0002,519,040