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 16, 2026 13:20marko1597marko1597Score: 5,418Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 16, 2026 13:505,36354,551,34343,373,0001,148,0002,113,536
2Aug 16, 2026 13:505,40155,161,32843,692,0001,143,0002,113,536
3Aug 16, 2026 13:505,40455,621,58243,706,0001,148,0002,113,536
4Aug 16, 2026 13:505,41555,001,60843,808,0001,141,0002,113,536
5Aug 16, 2026 13:505,41856,867,95043,812,0001,158,0002,113,536
6Aug 16, 2026 13:505,42455,761,58143,854,0001,167,0002,113,536
7Aug 16, 2026 13:505,42856,180,77643,873,0001,180,0002,113,536
8Aug 16, 2026 13:505,44855,960,45344,213,0001,012,0002,113,536
9Aug 16, 2026 13:505,57656,971,20745,251,0001,034,0002,113,536