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 10, 2026 17:18Daniel MastalerzDaniel MastalerzScore: 9,340Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 10, 2026 17:189,172101,962,53167,113,0009,015,0002,355,200
2Feb 10, 2026 17:189,20497,952,05267,348,0009,046,0002,478,080
3Feb 10, 2026 17:189,231100,861,69268,556,0008,065,0002,473,984
4Feb 10, 2026 17:189,340102,136,72870,473,0007,047,0002,498,560
5Feb 10, 2026 17:189,366109,132,18168,765,0008,969,0002,342,912
6Feb 10, 2026 17:189,375103,844,95170,830,0006,983,0002,310,144