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:15marko1597marko1597Score: 5,889Success
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:385,87358,574,03047,580,0001,174,0002,113,536
2Aug 16, 2026 13:385,87658,599,96647,621,0001,158,0002,113,536
3Aug 16, 2026 13:385,88158,609,40347,814,0001,005,0002,113,536
4Aug 16, 2026 13:385,88358,651,28747,658,0001,175,0002,113,536
5Aug 16, 2026 13:385,88958,719,33647,717,0001,168,0002,113,536
6Aug 16, 2026 13:386,03159,940,60548,886,0001,172,0002,113,536
7Aug 16, 2026 13:386,03861,229,18948,942,0001,180,0002,113,536
8Aug 16, 2026 13:386,05260,093,24749,056,0001,182,0002,113,536
9Aug 16, 2026 13:386,43063,294,18052,362,0001,008,0002,113,536