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 listFeb 20, 2026 19:23wnwnScore: 8,977Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 20, 2026 19:238,96995,162,98972,433,0002,012,0002,281,472
2Feb 20, 2026 19:238,97799,484,81573,501,0001,006,0002,486,272
3Feb 20, 2026 19:238,98097,382,79373,529,0001,007,0002,281,472