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 25, 2022 14:36Yuriy LyfenkoYuriy LyfenkoScore: 19,523Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 25, 2022 14:3619,430182,579,890160,265,0001,001,0002,478,080
2Jul 25, 2022 14:3619,441187,179,221159,368,0001,992,0002,437,120
3Jul 25, 2022 14:3619,455193,868,263160,475,0001,002,0002,441,216
4Jul 25, 2022 14:3619,480192,520,203158,691,0002,994,0002,420,736
5Jul 25, 2022 14:3619,503185,041,188159,879,0001,998,0002,314,240
6Jul 25, 2022 14:3619,512188,488,058158,954,0002,999,0002,387,968
7Jul 25, 2022 14:3619,523190,210,858160,044,0002,000,0002,445,312
8Jul 25, 2022 14:3619,540188,986,544160,184,0002,002,0002,412,544
9Jul 25, 2022 14:3619,567188,599,171161,408,0001,002,0002,424,832
10Jul 25, 2022 14:3619,621235,805,433162,852,16902,191,360
11Jul 25, 2022 14:3619,665249,211,899163,223,02602,199,552
12Jul 25, 2022 14:3619,714242,419,242163,629,31902,297,856