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 14, 2026 13:55marko1597marko1597Score: 211,426Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 14, 2026 13:57210,6431,760,902,5021,747,203,0001,138,0002,117,632stderr
2Aug 14, 2026 13:57210,8691,760,296,6171,749,065,0001,151,0002,117,632stderr
3Aug 14, 2026 13:57211,0101,761,488,2121,750,152,0001,232,0002,117,632stderr
4Aug 14, 2026 13:57211,3571,764,393,9451,753,091,0001,179,0002,117,632stderr
5Aug 14, 2026 13:57211,4261,765,578,2311,753,618,0001,226,0002,117,632stderr
6Aug 14, 2026 13:57211,4961,765,545,3261,754,416,0001,002,0002,117,632stderr
7Aug 14, 2026 13:57211,6131,766,472,6831,755,391,0001,001,0002,117,632stderr
8Aug 14, 2026 13:57212,0871,770,462,0801,759,166,0001,164,0002,117,632stderr
9Aug 14, 2026 13:57213,0621,779,618,9601,767,415,0001,005,0002,117,632stderr