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 9, 2026 18:49Ayush SharmaAyush SharmaScore: 178,101Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 9, 2026 18:49177,3191,504,823,2541,231,952,000239,796,0002,420,736
2Feb 9, 2026 18:49177,3411,493,489,2341,233,102,000238,826,0002,428,928
3Feb 9, 2026 18:49177,5381,503,692,2051,231,798,000241,764,0002,424,832
4Feb 9, 2026 18:49177,6001,498,847,1161,233,231,000240,849,0002,351,104
5Feb 9, 2026 18:49178,1011,500,907,3591,235,363,000242,874,0002,428,928
6Feb 9, 2026 18:49178,1731,511,362,0221,235,029,000243,808,0002,330,624
7Feb 9, 2026 18:49178,2471,511,152,7311,233,542,000245,908,0002,473,984
8Feb 9, 2026 18:49178,2811,510,409,0201,234,941,000244,790,0002,441,216
9Feb 9, 2026 18:49178,3161,505,634,8551,233,184,000246,836,0002,510,848