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 listDec 31, 2024 18:06matsuoka-601matsuoka-601Score: 81,098Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 31, 2024 18:0681,087698,788,671672,021,0001,000,0002,416,640
2Dec 31, 2024 18:0681,098698,472,323669,117,0004,000,0002,416,640
3Dec 31, 2024 18:0681,167703,611,477671,690,0001,999,0002,416,640