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 18, 2026 16:39wnwnScore: 10,311Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 18, 2026 16:3910,100106,814,34481,838,0001,996,0002,441,216
2Feb 18, 2026 16:3910,146108,033,07183,206,0001,002,0002,445,312
3Feb 18, 2026 16:3910,258105,383,34583,136,0002,003,0002,437,120
4Feb 18, 2026 16:3910,311110,231,69683,572,0002,013,0002,281,472
5Feb 18, 2026 16:3910,328109,229,10882,731,0002,990,0002,437,120
6Feb 18, 2026 16:3910,364106,805,45784,022,0002,000,0002,281,472