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 11, 2024 01:58jojoylfengjojoylfengScore: 1,648,554Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 11, 2024 01:571,645,40513,709,145,86213,656,862,82902,260,992
2Jan 11, 2024 01:571,645,80513,731,524,90313,660,179,99902,260,992
3Jan 11, 2024 01:581,645,84013,723,387,60013,660,475,91702,248,704
4Jan 11, 2024 01:581,648,55413,761,784,06713,683,001,27902,265,088
5Jan 11, 2024 01:571,657,49313,814,692,50813,757,194,35702,265,088
6Jan 11, 2024 01:581,663,54713,862,214,16813,807,442,62402,252,800