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 listAug 17, 2025 07:35Ashish AhujaAshish AhujaScore: 14,944Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 17, 2025 07:3514,382146,192,923105,444,00013,926,0002,342,912
2Aug 17, 2025 07:3514,478151,136,311107,150,00013,018,0002,306,048
3Aug 17, 2025 07:3514,626146,673,387108,458,00012,935,0002,531,328
4Aug 17, 2025 07:3514,868149,148,628112,455,00010,947,0002,351,104
5Aug 17, 2025 07:3514,944150,905,287109,029,00015,004,0002,351,104
6Aug 17, 2025 07:3515,009155,073,549114,609,0009,966,0002,301,952
7Aug 17, 2025 07:3515,076156,538,139113,121,00012,012,0002,355,200
8Aug 17, 2025 07:3515,137149,691,045111,678,00013,959,0002,342,912
9Aug 17, 2025 07:3515,303151,215,130114,016,00013,001,0002,285,568