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 14:15marko1597marko1597Score: 6,451Success
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 14:196,43363,390,82452,246,0001,149,0002,113,536
2Aug 14, 2026 14:196,44363,469,94152,246,0001,238,0002,113,536
3Aug 14, 2026 14:196,44663,576,07252,270,0001,238,0002,113,536
4Aug 14, 2026 14:196,45064,523,71052,290,0001,249,0002,113,536
5Aug 14, 2026 14:196,45163,624,52952,316,0001,232,0002,113,536
6Aug 14, 2026 14:196,45363,626,21352,352,0001,216,0002,113,536
7Aug 14, 2026 14:196,45563,649,85852,362,0001,222,0002,113,536
8Aug 14, 2026 14:196,45864,556,63952,365,0001,242,0002,113,536
9Aug 14, 2026 14:196,59965,388,82153,633,0001,140,0002,113,536