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 21, 2024 19:27KrishanKrishanScore: 57,310Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 21, 2024 19:2757,249499,814,426474,169,0001,000,0002,375,680
2Nov 21, 2024 19:2757,279503,671,068473,420,0001,997,0002,371,584
3Nov 21, 2024 19:2757,300503,787,279473,592,0001,998,0002,293,760
4Nov 21, 2024 19:2757,307504,151,728473,651,0001,998,0002,293,760
5Nov 21, 2024 19:2757,310501,854,423474,670,000999,0002,375,680
6Nov 21, 2024 19:2757,339499,493,301475,916,00002,293,760
7Nov 21, 2024 19:2757,344505,780,086473,955,0001,999,0002,379,776
8Nov 21, 2024 19:2757,369504,550,134476,164,00002,285,568
9Nov 21, 2024 19:2757,372502,782,003475,188,0001,000,0002,293,760