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 8, 2024 14:28Matthew BookerMatthew BookerScore: 74,335Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 8, 2024 14:2874,317640,538,753615,832,000999,0002,289,664
2Sep 8, 2024 14:2874,335639,797,600614,980,0001,999,0002,531,328
3Sep 8, 2024 14:2874,362649,047,580616,206,0001,000,0002,289,664