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 19:59Josu San MartinJosu San MartinScore: 4,344Success
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 20:004,33144,342,78334,918,0001,030,0002,113,536
2Aug 30, 2026 20:004,33944,481,34334,971,0001,048,0002,113,536
3Aug 30, 2026 20:004,34344,422,33235,006,0001,042,0002,113,536
4Aug 30, 2026 20:004,34444,489,94335,025,0001,032,0002,113,536
5Aug 30, 2026 20:004,34444,443,69135,020,0001,040,0002,113,536
6Aug 30, 2026 20:004,34644,491,04835,028,0001,048,0002,113,536
7Aug 30, 2026 20:004,36844,660,84135,211,0001,046,0002,113,536
8Aug 30, 2026 20:004,38644,861,34235,353,0001,053,0002,113,536
9Aug 30, 2026 20:004,47345,509,32136,099,0001,027,0002,113,536