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 listOct 8, 2024 03:46Lickety SplitLickety SplitScore: 96,325Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 8, 2024 03:4696,318829,353,852778,458,00020,985,0002,420,736
2Oct 8, 2024 03:4696,325826,873,847777,511,00021,986,0002,396,160
3Oct 8, 2024 03:4696,330824,122,809783,545,00015,990,0002,396,160