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 listNov 11, 2024 07:51ndbnndbnScore: 190,327Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 11, 2024 07:51189,9271,596,401,8531,487,431,00088,965,0002,453,504
2Nov 11, 2024 07:51190,0081,600,867,8981,491,121,00085,949,0002,371,584
3Nov 11, 2024 07:51190,2961,603,341,1481,490,484,00088,969,0002,482,176
4Nov 11, 2024 07:51190,3201,606,709,8621,490,732,00088,924,0002,265,088
5Nov 11, 2024 07:51190,3271,605,997,5471,492,734,00086,984,0002,469,888
6Nov 11, 2024 07:51190,3371,605,475,2611,489,862,00089,931,0002,322,432
7Nov 11, 2024 07:51190,4721,610,261,6541,496,083,00084,834,0002,273,280
8Nov 11, 2024 07:51191,4491,615,436,4721,500,080,00088,945,0002,478,080
9Nov 11, 2024 07:51193,4431,632,707,8421,512,662,00092,917,0002,273,280