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 listApr 17, 2023 09:42Mo AboulmagdMo AboulmagdScore: 469,396Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 17, 2023 09:42468,7383,949,852,8923,890,523,13502,232,320
2Apr 17, 2023 09:28468,9493,949,446,8353,892,276,32402,244,608
3Apr 17, 2023 09:28468,9913,970,036,1693,892,623,19602,240,512
4Apr 17, 2023 09:28469,3963,957,264,7153,895,985,85802,236,416
5Apr 17, 2023 09:42470,0603,975,188,7783,901,498,69902,240,512
6Apr 17, 2023 09:42471,7203,987,757,0283,915,272,07002,260,992