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 17, 2026 17:32wnwnScore: 8,050Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 17, 2026 17:327,97488,359,31763,179,0003,008,0002,408,448
2Feb 17, 2026 17:328,00394,121,55362,399,0004,025,0002,433,024
3Feb 17, 2026 17:328,01696,992,16463,509,0003,024,0002,408,448
4Feb 17, 2026 17:328,038101,653,54561,738,0004,978,0002,433,024
5Feb 17, 2026 17:328,05090,504,26163,823,0002,991,0002,441,216
6Feb 17, 2026 17:328,07994,754,82064,052,0003,002,0002,441,216
7Feb 17, 2026 17:328,12589,378,36564,418,0003,019,0002,437,120
8Feb 17, 2026 17:328,22699,258,52365,260,0003,012,0002,445,312
9Feb 17, 2026 17:328,30193,474,88964,908,0003,994,0002,420,736