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 15, 2026 22:32wnwnScore: 9,740Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 15, 2026 22:328,42595,317,05661,933,0007,991,0002,433,024
2Feb 15, 2026 22:328,53797,766,25763,868,0006,985,0002,506,752
3Feb 15, 2026 22:328,55993,684,30662,035,0009,005,0002,433,024
4Feb 15, 2026 22:329,740102,963,62871,858,0008,982,0002,453,504
5Feb 15, 2026 22:329,790102,587,65274,238,0007,022,0002,437,120
6Feb 15, 2026 22:329,853106,943,01172,807,0008,976,0002,281,472