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 listSep 13, 2024 09:19Rajarshi BasuRajarshi BasuScore: 54,310Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 13, 2024 09:1954,192473,701,772441,799,0007,996,000405,504
2Sep 13, 2024 09:1954,254477,816,213442,301,0008,005,0002,408,448
3Sep 13, 2024 09:1954,271482,818,594443,444,0007,007,000401,408
4Sep 13, 2024 09:1954,295477,735,588443,656,0006,994,0002,265,088
5Sep 13, 2024 09:1954,310476,442,670442,776,0007,995,000397,312
6Sep 13, 2024 09:1954,317476,813,931443,837,0006,997,0002,412,544
7Sep 13, 2024 09:1954,319475,335,393442,854,0007,997,000307,200
8Sep 13, 2024 09:1954,322476,215,246442,878,0007,997,0002,400,256
9Sep 13, 2024 09:1954,326474,348,602442,909,0007,998,000360,448