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 12, 2024 12:46Dmitrii KravchenkoDmitrii KravchenkoScore: 43,675Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 12, 2024 12:4643,367383,816,287357,945,0001,999,0002,281,472
2Sep 12, 2024 12:4643,522388,496,876360,231,0001,000,0002,310,144
3Sep 12, 2024 12:4643,550391,291,342361,463,00002,281,472
4Sep 12, 2024 12:4643,628393,435,528361,116,0001,000,0002,326,528
5Sep 12, 2024 12:4643,675387,905,333360,509,0001,997,0002,318,336
6Sep 12, 2024 12:4643,678387,820,523362,524,00002,281,472
7Sep 12, 2024 12:4643,685385,436,111361,584,000998,0002,314,240
8Sep 12, 2024 12:4643,704390,150,434360,743,0001,998,0002,281,472
9Sep 12, 2024 12:4643,723391,751,684360,903,0001,999,0002,281,472