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:05matsuoka-601matsuoka-601Score: 81,252Success
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:0581,193704,200,582670,905,0002,999,0002,314,240
2Dec 31, 2024 18:0581,252701,760,976673,389,000999,0002,322,432
3Dec 31, 2024 18:0581,287704,281,190672,687,0001,999,0002,445,312