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 listAug 12, 2026 06:14Victor MerckléVictor MerckléScore: 11,461Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 12, 2026 06:1511,393102,995,07789,377,0005,187,0002,117,632stderr
2Aug 12, 2026 06:1511,437103,321,36789,535,0005,400,0002,117,632stderr
3Aug 12, 2026 06:1511,446103,370,77089,665,0005,344,0002,117,632stderr
4Aug 12, 2026 06:1511,449103,248,99289,727,0005,301,0002,117,632stderr
5Aug 12, 2026 06:1511,461103,379,40989,771,0005,359,0002,117,632stderr
6Aug 12, 2026 06:1511,471103,519,04589,930,0005,286,0002,117,632stderr
7Aug 12, 2026 06:1511,533104,115,93790,586,0005,146,0002,117,632stderr
8Aug 12, 2026 06:1511,560104,164,71090,730,0005,223,0002,117,632stderr
9Aug 12, 2026 06:1511,590104,659,28890,389,0005,812,0002,117,632stderr