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 6, 2024 13:01Matthew BookerMatthew BookerScore: 75,102Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 6, 2024 13:0175,049645,335,823603,910,00018,997,0002,375,680
2Sep 6, 2024 13:0175,102650,213,094604,337,00019,010,0002,383,872
3Sep 6, 2024 13:0175,121648,301,354602,523,00020,983,0002,469,888