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 listJul 24, 2023 20:47LukasLukasScore: 352,034Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 24, 2023 20:47350,7562,969,361,6562,911,273,49502,191,360
2Jul 24, 2023 20:48351,7582,984,898,6692,919,592,10602,314,240
3Jul 24, 2023 20:48351,9352,977,773,8942,921,062,06202,199,552
4Jul 24, 2023 20:47352,0342,993,763,1962,921,883,18402,195,456
5Jul 24, 2023 20:48354,0863,005,245,5862,938,909,84002,199,552
6Jul 24, 2023 20:47357,8633,051,032,0582,970,264,65702,260,992