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 listJul 27, 2026 20:09boop34boop34Score: 8,880Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 27, 2026 20:098,84083,196,62872,358,0001,022,0002,113,536
2Jul 27, 2026 20:098,85085,175,83672,434,0001,023,0002,113,536
3Jul 27, 2026 20:098,85383,245,59872,461,0001,022,0002,113,536
4Jul 27, 2026 20:098,86983,408,90972,593,0001,022,0002,113,536
5Jul 27, 2026 20:098,88083,529,78772,686,0001,024,0002,113,536
6Jul 27, 2026 20:098,88783,552,77672,742,0001,022,0002,113,536
7Jul 27, 2026 20:098,90783,673,17272,904,0001,025,0002,113,536
8Jul 27, 2026 20:098,94984,321,24773,254,0001,024,0002,113,536
9Jul 27, 2026 20:099,16285,895,71775,023,0001,023,0002,113,536