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 listMay 3, 2026 04:57limanjun99limanjun99Score: 5,605Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 3, 2026 04:575,58364,377,55441,306,0005,037,0002,363,392
2May 3, 2026 04:575,59962,549,92641,424,0005,051,0002,424,832
3May 3, 2026 04:575,60060,812,52940,418,0006,062,0002,416,640
4May 3, 2026 04:575,60262,441,73139,422,0007,075,0002,416,640
5May 3, 2026 04:575,60567,026,10142,478,0004,045,0002,420,736
6May 3, 2026 04:575,61663,581,03840,537,0006,080,0002,424,832
7May 3, 2026 04:575,62963,578,57439,766,0006,959,0002,412,544
8May 3, 2026 04:575,67065,403,33741,055,0006,008,0002,457,600
9May 3, 2026 04:575,81166,133,16441,201,0007,034,0002,412,544