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 30, 2026 18:01Josu San MartinJosu San MartinScore: 4,520Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 30, 2026 18:024,49545,750,11136,273,0001,039,0002,113,536
2Aug 30, 2026 18:024,50245,843,25236,247,0001,127,0002,113,536
3Aug 30, 2026 18:024,50745,811,05736,282,0001,130,0002,113,536
4Aug 30, 2026 18:024,51345,971,21936,342,0001,122,0002,113,536
5Aug 30, 2026 18:024,52045,970,71036,401,0001,123,0002,113,536
6Aug 30, 2026 18:024,52446,013,49936,432,0001,118,0002,113,536
7Aug 30, 2026 18:024,52946,011,91236,491,0001,106,0002,113,536
8Aug 30, 2026 18:024,53546,084,77536,518,0001,127,0002,113,536
9Aug 30, 2026 18:024,54846,271,76336,721,0001,028,0002,113,536