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 listJul 27, 2024 16:34Lickety SplitLickety SplitScore: 153,914Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 27, 2024 16:34153,5881,343,127,1161,274,783,63502,297,856
2Jul 27, 2024 16:34153,9141,341,138,4411,277,483,13902,306,048
3Jul 27, 2024 16:34154,0681,338,133,3781,278,764,91602,174,976