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 listJan 21, 2025 01:58Gerard SmitGerard SmitScore: 101,638Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 21, 2025 01:58101,365866,500,438751,399,00089,928,0002,523,136
2Jan 21, 2025 01:58101,370866,665,803756,434,00084,936,0002,387,968
3Jan 21, 2025 01:58101,497867,086,678741,491,000100,930,0002,297,856
4Jan 21, 2025 01:58101,540864,986,289731,808,000110,970,0002,314,240
5Jan 21, 2025 01:58101,638868,471,176751,641,00091,956,0002,379,776
6Jan 21, 2025 01:58101,756871,273,506757,622,00086,956,0002,314,240
7Jan 21, 2025 01:58102,104873,900,988759,518,00087,944,0002,396,160
8Jan 21, 2025 01:58102,139871,504,612762,780,00084,975,0002,310,144
9Jan 21, 2025 01:58102,356874,416,321754,603,00094,950,0002,498,560